import java.util.HashMap;
import java.util.Map;
import java.util.Scanner;

public class Test1 {
    public static void main(String[] args) {
        Scanner scan = new Scanner(System.in);
        String str = scan.nextLine() ;
        Map<Character,Integer> map = new HashMap<>() ;
        for(int i = 0 ; i < str.length() ; i++){
            char tmp = str.charAt(i);
            if(map.get(tmp)  == null){
                map.put(tmp , 1);
            }else{
                int val = map.get(tmp);
                map.put(tmp,val+1);
            }
        }
        int max  = map.get(str.charAt(0)) ;
        int min = max ;
        for(int i = 1 ; i < str.length() ;i ++){
            char tmp = str.charAt(i);
            int val = map.get(tmp);
            if(val > max){
                max = val;
            }
            if(val < min){
                min = val ;
            }
        }
        if(isZhiShu(max - min)){
            System.out.println("Lucky Word");
            System.out.println(max-min);

        }else{
            System.out.println("No Answer");
            System.out.println(0);
        }




    }

    private static boolean isZhiShu(int n){
        if(n <= 1){
            return false ;
        }
        int max =(int) Math.sqrt(n) +1 ;
        for(int i = 2 ; i < max ; i ++){
            if(n % i == 0){
                return false ;
            }
        }
        return true ;

    }
}
